Structures preserved by the QR-algorithm
نویسندگان
چکیده
In this talk we investigate some classes of structures that are preserved by applying a QR step on a matrix A. We will handle two classes of such structures: the first we call polynomial structures, for example a matrix being Hermitian or Hermitian up to a rank one correction, and the second we call rank structures, which are encountered for example in all kinds of what we could call Hessenberglike and semiseparable-like matrices. An advantage of our approach is that we define a structure by decomposing it as a collection of building stones which we call structure blocks. This allows us to state the results in their natural, most general context.
منابع مشابه
Rank structures preserved by the QR-algorithm: the singular case
In an earlier paper we introduced the classes of polynomial and rank structures, both of them preserved by applying a (shifted) QRstep on a matrix A. In the present paper we will further investigate the case of rank structures. We will show that even if A is a singular matrix, a new QR-iterate can be constructed having the same rank structure as the matrix A itself. To this end we will introduc...
متن کاملImplicit double shift QR-algorithm for companion matrices
In this paper an implicit (double) shifted QR-method for computing the eigenvalues of companion and fellow matrices will be presented. Companion and fellow matrices are Hessenberg matrices, that can be decomposed into the sum of a unitary and a rank 1 matrix. The Hessenberg, the unitary as well as the rank 1 structures are preserved under a step of the QR-method. This makes these matrices suita...
متن کاملMatrix shapes invariant under the symmetric QR algorithm
It is shown, which zero patterns of symmetric matrices are preserved under the QR algorithm.
متن کاملRestructuring the QR Algorithm for Performance
We show how the QR algorithm can be restructured so that it becomes rich in operations that can achieve near-peak performance on a modern processor. The key is a novel algorithm for applying multiple sets of Givens rotations. We demonstrate the merits of this new QR algorithm for computing the Hermitian (symmetric) eigenvalue decomposition and singular value decomposition of dense matrices when...
متن کاملOn the QR algorithm and updating the SVD and URV decomposition in Parallel
A Jacobi-type updating algorithm for the SVD or URV decomposition is developed, which is related to the QR algorithm for the symmetric eigenvalue problem. The algorithm employs one-sided transformations, and therefore provides a cheap alternative to earlier developed updating algorithms based on two-sided transformations. The present algorithm as well as the corresponding systolic implementatio...
متن کامل